منابع مشابه
Systolic Tree Acceptors
— This paper introduces systolic automata for VLSI as highly concurrent acceptors. Attention is focused on tree automata although other types are also discussed briefly. A number of preliminary results about the capabilities of such automata are obtained. The approach not only opens up a new and interesting area oflanguage theory but also its results give useful hints for VLSI system design par...
متن کاملBottom-Up Tree Acceptors
This paper deals with the formal derivation of an eecient tabulation algorithm for table-driven bottom-up tree acceptors. Bottom-up tree acceptors are based on a notion of match sets. First we derive a naive acceptance algorithm using dynamic computation of match sets. Tabulation of match sets leads to an eecient acceptance algorithm, but tables may be so large that they can not be generated du...
متن کاملSystolic Tree !-Languages
The class of !-languages recognized by systolic tree automa-ta is introduced. That class extends the class of B uchi !-languages and is closed under boolean operations. The emptiness problem for systolic tree automata on innnite sequences is decidable. A characterization of sys-tolic tree !-languages in terms of a (suitable) concatenation of ((nitary) systolic tree languages is also provided.
متن کاملSystolic Routing in an Optical Fat Tree
In this paper we present an all-optical network architecture and a systolic routing protocol for it. An -dimensional optical fat tree network ( ) consists of routing nodes and processing nodes deployed at the leaf nodes of the network. In our construction packets injected into the carry no routing information. Routing is based on the use of a cyclic control bit sequence and scheduling. The syst...
متن کاملSystolic Tree ! - Languages : The Operational andthe Logical
The class of !-languages recognized by systolic (binary) tree automata is introduced. That class extends the class of B uchi !-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree !-languages is characterized in terms of a (suitable) concatenation of ((nitary) systolic tree languages. A generalization of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO. Informatique théorique
سال: 1984
ISSN: 0399-0540
DOI: 10.1051/ita/1984180100531